Incompleteness of Behavioral Logics
نویسندگان
چکیده
منابع مشابه
Incompleteness of Behavioral Logics
Incompleteness results for behavioral logics are investigated. We show that there is a basic finite behavioral specification for which the behavioral satisfaction problem is not recursively enumerable, which means that there are no automatic methods for proving all true statements; in particular, behavioral logics do not admit complete deduction systems. This holds for all of the behavioral log...
متن کاملIncompleteness of Behavioral Logics - 7
Incompleteness results for various behavioral logics are investigated. We show that hidden algebra, observational logic, coherent hidden algebra and other current generalizations of hidden algebra do not admit complete deduction systems for equational behavioral satisfaction. The technique used is reduction from a non-recursively enumerable problem to behavioral validity. In fact we show a stro...
متن کاملIncompleteness of Behavioral Logics - 24 December 1999
Incompleteness results for behavioral logics are investigated. We show that there is a basic nite behavioral speciication for which the behavioral satisfaction problem is not recursively enumerable, which means that there are no automatic methods for proving all true statements; in particular, behavioral logics do not admit complete deduction systems. This holds for all of the behavioral logics...
متن کاملBehavioral Algebraization of Logics
The theory of abstract algebraic logic (AAL) studies the mechanism by which a class of algebras can be associated with a given logic. Despite of its success, the traditional tools of AAL have a rather limited scope of application. In this dissertation we generalize the notion of algebraizable logic using the tools of many-sorted behavioral algebra. In this way, we extended the scope of applicat...
متن کاملOn Incompleteness of Multi-dimensional First-order Temporal Logics
In this paper we show that first-order temporal logics form a proper expressiveness hierarchy with respect to dimensionality and quantifier depth of temporal connectives. This result resolves (negatively) the open question concerning the existence of an expressively complete first-order temporal logic, even when allowing multi-dimensional temporal connectives.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2000
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80756-x